Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
نویسندگان
چکیده
منابع مشابه
Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
متن کاملDependent Cartesian Closed Categories
We present a generalization of cartesian closed categories (CCCs) for dependent types, called dependent cartesian closed categories (DCCCs), which also provides a reformulation of categories with families (CwFs), an abstract semantics for Martin-Löf type theory (MLTT) which is very close to the syntax. Thus, DCCCs accomplish mathematical elegance as well as a direct interpretation of the syntax...
متن کاملCartesian closed Dialectica categories
When Gödel developed his functional interpretation, also known as the Dialectica interpretation, his aim was to prove (relative) consistency of first order arithmetic by reducing it to a quantifier-free theory with finite types. Like other functional interpretations (e.g. Kleene’s realizability interpretation and Kreisel’s modified realizability) Gödel’s Dialectica interpretation gives rise to ...
متن کاملCartesian closed stable categories q
The aim of this paper is to establish some Cartesian closed categories which are between the two Cartesian closed categories: SLP (the category of L-domains and stable functions) and DI (the full subcategory of SLP whose objects are all dI-domains). First we show that the exponentials of every full subcategory of SLP are exactly the spaces of stable functions. Then we prove that the full subcat...
متن کاملFixed Points in Cartesian Closed Categories
The purpose of this paper is to begin the study of domain theory in a context that is also appropriate for semantic models of other aspects of computation, that is in cartesian closed categories with a natural numbers object. I show that if D is an internally ω -complete partial order with bottom in such a category, then the usual construction of least fixed point of an ω -continuous endomorphi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(3:10)2013